On spanning tree problems with multiple objectives
نویسندگان
چکیده
منابع مشابه
Minimum Cost Spanning Tree Problems with Restrictions on Coalitions
We focus on minimum cost spanning tree problems (mcstps) where agents need to be connected with a source directly or indirectly through other agents with the minimum cost. Mcstps have been studied as cooperative games, where all of agents cooperate to construct a minimum cost spanning tree (mcst), and share the cost of the mcst. There actually exist situations where some coalitions of agents ar...
متن کاملMulti-Source Spanning Tree Problems
We consider a model of communication in a network, where multiple sources have messages to disseminate among the network membership. We propose that all the messages (one from each source) be disseminated along the same spanning tree of the network and consider the problem of constructing such a tree. One evaluative measure for suitability of the construction is the sum of distances from each s...
متن کاملReload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کاملInverse Spanning Tree Problems: Formulations and Algorithms
Given a solution x* and an a priori estimated cost vector c, the inverse optimization problem is to identify another cost vector d so that x* is optimal with respect to the cost vector d and the deviation of d from c is minimum. In this paper, we consider the inverse spanning tree problem on an undirected graph G = (N, A) with n nodes and m arcs, and where the deviation between c and d is defin...
متن کاملalgorithms for parametric minimum spanning tree problems on planar graphs ’
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1994
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02032304